Mining Maximal Fuzzy Colocation Patterns

نویسندگان

چکیده

Spatial colocation pattern mining is to discover the subsets of spatial objects frequently appearing together in adjacent geographic locations. In existing research, several algorithms were proposed for excavating maximal prevalent patterns. Furthermore, fuzzy neighborhood relationship(FNR) was employed evaluate proximity between instances improving accuracy results. However, approach discovering patterns based on FNR not studied yet. This paper defines (MFPCP). We propose a algorithm generate MFPCPs instead all conduct experiments real datasets performance algorithm.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fast Mining Maximal Sequential Patterns

Sequential patterns mining is now widely used in many areas, such as the analysis of e-Learning sequential patterns, web log analysis, customer buying behavior analysis and etc. In the discipline of data mining, runtime and search space are always the two major issues. In this paper, we had study many previous works to analyze these two problems, and propose a new algorithm with more condense s...

متن کامل

Computational aspects of mining maximal frequent patterns

In this paper we study the complexity-theoretic aspects of mining maximal frequent patterns, from the perspective of counting the number of all distinct solutions. We present the first formal proof that the problem of counting the number of maximal frequent itemsets in a database of transactions, given an arbitrary support threshold, is #P-complete, thereby providing theoretical evidence that t...

متن کامل

Mining Maximal Sequential Patterns without Candidate Maintenance

Sequential pattern mining is an important data mining task with wide applications. However, it may present too many sequential patterns to users, which degrades the performance of the mining task in terms of execution time and memory requirement, and makes it difficult for users to comprehend the results. The problem becomes worse when dealing with dense or long sequences. As a solution, severa...

متن کامل

Mining Maximal Flexible Patterns in a Sequence

We consider the problem of enumerating all maximal flexible patterns in an input sequence database for the class of flexible patterns, where a maximal pattern (also called a closed pattern) is the most specific pattern among the equivalence class of patterns having the same list of occurrences in the input. Since our notion of maximal patterns is based on position occurrences, it is weaker than...

متن کامل

Mining Negative Fuzzy Sequential Patterns

Many methods have been proposed for mining fuzzy sequential patterns. However, most of conventional methods only consider the occurrences of fuzzy itemsets in sequences. The fuzzy sequential patterns discovered by these methods are called as positive fuzzy sequential patterns. In practice, the absences of frequent fuzzy itemsets in sequences may imply significant information. We call a fuzzy se...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Frontiers in artificial intelligence and applications

سال: 2022

ISSN: ['1879-8314', '0922-6389']

DOI: https://doi.org/10.3233/faia220104